Secure Message Transmission using Lagrange Polynomial Interpolation and Huffman Coding
نویسندگان
چکیده
منابع مشابه
Secure Message Transmission using Lagrange Polynomial Interpolation and Huffman Coding
In this paper, an algorithm for secure transmission of message is proposed based on Lagrange's interpolation. The message is viewed as a polynomial of degree n where n is kept secret and transmitted to the receiver's side using the concept of a digital envelope. As any nth degree polynomial is uniquely determined by n+1 points, n +1 points are communicated to the other side, where the...
متن کاملInnovative Methodologies for Secure Multimedia Communications Using Birkhoff Polynomial Interpolation
Security of multimedia communications is regarded by both academy and industry research as one of the most important and urgent problems of the last decades. In order to improve existing solutions, we propose a framework based on Birkhoff polynomial interpolation. Such new mathematical tool based on this theory improves the classical secret sharing scheme based on Lagrange interpolation widely ...
متن کاملOn Lagrange multivariate interpolation problem in generalized degree polynomial spaces
The aim of this paper is to study the Lagrange multivariate interpolation problems in the space of polynomials of w-degree n. Some new results concerning the polynomial spaces of w-degree n are given. An algorithm for obtaining the w-minimal interpolation space is presented. Key–Words: Lagrange multivariate polynomial interpolation, whomogeneous polynomial spaces, Generalize degree.
متن کاملCounterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation
We apply multivariate Lagrange interpolation to synthesizing polynomial quantitative loop invariants for probabilistic programs. We reduce the computation of an quantitative loop invariant to solving constraints over program variables and unknown coefficients. Lagrange interpolation allows us to find constraints with less unknown coefficients. Counterexample-guided refinement furthermore genera...
متن کاملProtocols for Reliable and Secure Message Transmission
Consider the following problem: a sender S and a receiver R are part of an unreliable, connected, distributed network. The distrust in the network is modelled by an entity called adversary, who has unbounded computing power and who can corrupt some of the nodes of the network (excluding S and R) in a variety of ways. S wishes to send to R a message m that consists of l elements, where l ≥ 1, se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/8721-2593